Efficiently Reprogramming Boolean Functions by sTCAM/RAM
نویسندگان
چکیده
A device for boolean mappings Bn -> Bm, B={0,1}, n, m ∈ Ν is given that is hardware efficient and quickly reprogrammable, combining the best features of look-up tables and programmable logic arrays (PLAs). It is especially suited to implement functions with large n, m. The device’s setup is given on the transistor level. Its hardware complexity is compared to look-up tables and PLAs by means of a detailed cost model.
منابع مشابه
I-5: Fifteen Years after Dolly: The Perspectives on Cellular Reprogramming
s:1202:"It is a truly amazing time to developmental biology. During recent decades, three important breakthroughs have been developed: (i) isolation of stem cells from embryo, (ii) animal cloning by nuclear transfer (NT), and (iii) and induced pluripotent stem cells (iPS). Considering these three approaches of "Cellular Reprogramming", it seems that the required elements for cell therapy now ex...
متن کاملON THE FUZZY SET THEORY AND AGGREGATION FUNCTIONS: HISTORY AND SOME RECENT ADVANCES
Several fuzzy connectives, including those proposed by Lotfi Zadeh, can be seen as linear extensions of the Boolean connectives from the scale ${0,1}$ into the scale $[0,1]$. We discuss these extensions, in particular, we focus on the dualities arising from the Boolean dualities. These dualities allow to transfer the results from some particular class of extended Boolean functions, e.g., from c...
متن کاملHow to Efficiently Evaluate RAM Programs with Malicious Security
Secure 2-party computation (2PC) is becoming practical for some applications. However, most approaches are limited by the fact that the desired functionality must be represented as a boolean circuit. In response, random-access machines (RAM programs) have recently been investigated as a promising alternative representation. In this work, we present the first practical protocols for evaluating R...
متن کاملOn the Fractional Chromatic Number of Monotone Self-dual Boolean Functions
We compute the exact fractional chromatic number for several classes of monotone self-dual Boolean functions. We characterize monotone self-dual Boolean functions in terms of the optimal value of a LP relaxation of a suitable strengthening of the standard IP formulation for the chromatic number. We also show that determining the self-duality of monotone Boolean function is equivalent to determi...
متن کاملArchitecture of Reconfigurable Processor for Implementing Search Algorithms over Discrete Matrices
The paper suggests architecture of a reconfigurable processor, which can be customized for implementing different search algorithms over discrete matrices. Such algorithms might be used for solving various problems of combinatorial optimization, such as covering, Boolean satisfiability, etc. The proposed architecture contains memory blocks for binary or ternary matrix, general-purpose registers...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006